Tootfinder

This https://arxiv.org/abs/2204.06068 has been replaced.
link: https://scholar.google.com/scholar?q=a

Encodability Criteria for Quantum Based Systems
Quantum based systems are a relatively new research area for that different modelling languages including process calculi are currently under development. Encodings are often used to compare process calculi. Quality criteria are used then to rule out trivial or meaningless encodings. In this new context of quantum based systems, it is necessary to analyse the applicability of these quality criteria and to potentially extend or adapt them. As a first step, we test the suitability of classical cr…

Google's Education VP wants us to believe AI is the classroom's new calculator, but this is a terrible analogy:
1. We know how calculators produce their results.
2. You can check a calculator's answer using pretty much the same algorithm it uses.
3. Rare floating point errors aside, calculators do not invent false answers.
4. Calculators are based on math principles; LLMs are based on no principles.

The list of swift challenges on this post align very closely with my own challenges.
One day, when I am not obsessed with Godot I should contribute to fix these:
https://forums.swift.org/t/our-journey-with-swift-thus-far-some-no…

Our journey with Swift thus far - some notes and reflections
Hello! Background Our team is quietly working on developing a new electronic trading system using Swift on macOS and Linux, building on our experience from two previous projects that have been done in C, Objective-C, C++, Java, C# and even for a while, homegrown DSL. All running on multiple OS:s at various points; NeXTSTEP, OpenStep, Windows NT, HP-UX, Solaris, Linux. These past projects have been fairly sizeable, with over 25 million lines of code and several hundred components between them o…

Exact lower bound of the uncertainty principle product for the harmonic oscillator with position-momentum coupling
Yamen Hamdouni
https://arxiv.org/abs/2402.07842

Exact lower bound of the uncertainty principle product for the harmonic oscillator with position-momentum coupling
We show that the uncertainty principle product for the position and momentum operators for a system described by the Hamiltonian $ \hat H= \frac{\hat{p}^2}{2m} +\frac{1}{2} m ω^2 \hat{x}^2+\fracμ{2}(\hat x \hat p+ \hat p \hat x)$ where $μ<ω$ reads $Δx Δp\ge\frac{\hbar ω}{2\sqrt{ω^2-μ^2}}$. All the values bellow this lower bound are thus quantum-mechanically forbidden. We construct the annihilation and creation operators for this system and we calculate the expectation values of the ope…

This https://arxiv.org/abs/2305.12975 has been replaced.
link: https://scholar.google.com/scholar?q=a

Graphical Proof Theory I: Sequent Systems on Undirected Graphs
In this paper we explore the design of sequent calculi operating on graphs. For this purpose, we introduce a set of logical connectives allowing us to extend the correspondence between cographs and classical propositional formulas to any graph. We then provide sequent calculi operating on these formulas, we prove cut-elimination and that formula encoding the same graph are logically equivalent. We show that these systems provide conservative extensions of multiplicative linear logic (with and w…

done
Arcadia composition is ridiculous lol #clae_ae

This https://arxiv.org/abs/2210.07085 has been replaced.
link: https://scholar.google.com/scholar?q=a

Towards Uniform Certification in QBF
We pioneer a new technique that allows us to prove a multitude of previously open simulations in QBF proof complexity. In particular, we show that extended QBF Frege p-simulates clausal proof systems such as IR-Calculus, IRM-Calculus, Long-Distance Q-Resolution, and Merge Resolution. These results are obtained by taking a technique of Beyersdorff et al. (JACM 2020) that turns strategy extraction into simulation and combining it with new local strategy extraction arguments. This approach leads…

Otsufuro #comicfrontier18 #cf18 ! Thank you to everyone who dropped by!
Local and international aftersales will be open soon, so stay tuned!

Superposition with Delayed Unification
Ahmed Bhayat, Johannes Schoisswohl, Michael Rawson
https://arxiv.org/abs/2403.04775 https://ar…

Superposition with Delayed Unification
Classically, in saturation-based proof systems, unification has been considered atomic. However, it is also possible to move unification to the calculus level, turning the steps of the unification algorithm into inferences. For calculi that rely on unification procedures returning large or even infinite sets of unifiers, integrating unification into the calculus is an attractive method of dovetailing unification and inference. This applies, for example, to AC-superposition and higher-order supe…

This https://arxiv.org/abs/2307.13360 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csLO_…

An Axiomatic Theory for Reversible Computation
Undoing computations of a concurrent system is beneficial in many situations, e.g., in reversible debugging of multi-threaded programs and in recovery from errors due to optimistic execution in parallel discrete event simulation. A number of approaches have been proposed for how to reverse formal models of concurrent computation including process calculi such as CCS, languages like Erlang, and abstract models such as prime event structures and occurrence nets. However it has not been settled wh…